A Prime-Number-based Matrix strategy for efficient iconic indexing of symbolic pictures

نویسندگان

  • Ye-In Chang
  • Bi-Yen Yang
چکیده

In the previous approaches to represent pictorial data as the complexity of the represen tation strategy is increased the more spatial relationships can be represented which also results in a more complex strategy for query processing and a limited types of queries that can be answered In this paper we propose an e cient iconic indexing scheme called Prime Number based Matrix PN Matrix for symbolic pictures which combines the ad vantages of the D C string and the DLT matrix Basically the proposed strategy can represent those complex relationships which are represented in D C strings in a matrix and an e cient module based operation can be used to support pictorial query spatial reasoning and similarity retrieval In the proposed scheme we classify spatial relation ships between two objects in D space into ve spatial categories and de ne a category rule for each of those ve spatial categories Those category rules are module operation based therefore they are e cient enough as compared to the previous approaches Following those category rules we propose algorithms to e ciently support spatial reasoning picture queries and similarity retrieval based on a data structure of a Prime Number based Matrix PN Matrix

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A unique-ID-based matrix strategy for efficient iconic indexing of symbolic pictures

In this paper we propose an e cient iconic indexing strategy called Unique ID based Ma trix UID Matrix for symbolic pictures in which each spatial relationship between any two objects is assigned with a unique identi er ID and is recorded in a matrix Basically the proposed strategy can represent those complex relationships that are represented in D C strings in a matrix and an e cient range che...

متن کامل

An efficient iconic indexing strategy for image rotation and reflection in image databases

Spatial relationships are important issues for similarity-based retrieval in many image database applications. With the popularity of digital cameras and the related image processing software, a sequence of images are often rotated or flipped. That is, those images are transformed in the rotation orientation or the reflection direction. However, many iconic indexing strategies based on symbolic...

متن کامل

A Three-Dimensional Iconic Environment for Image Database Querying

Retrieval by contents of images from pictorial databases can be effectively performed through visual icon-based systems. In these systems, the representation of pictures with 2D strings, which are derived from symbolic projections, provides an efficient and natural way to construct iconic indexes for pictures and is also an ideai representation for the visual query. With this approach, retrieva...

متن کامل

On Completeness of Reasoning about Planar Spatial Relationships in Pictorial Retrieval Systems∗

In this paper we consider the completeness problem of reasoning about planar spatial relationships in pictorial retrieval systems. We define a large class of two-dimensional scenes, the extended pseudo-symbolic pictures. The existing rule system R is proved to be complete for (extended) pseudo-symbolic pictures. We also introduce a new iconic indexing, the (extended) pseudo2D string representat...

متن کامل

Retrieving similar pictures from iconic databases using G-tree

G-tree, combining the features of both grids and B-trees, is a disk-based spatial data structure for organizing multidimensional data. This paper presents an efficient access method for retrieving similar pictures from iconic databases using G-tree. The proposed method preserves the merits of G-tree, and hence indexing the pictures in the database, processing range queries for similarity retrie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Pattern Recognition

دوره 30  شماره 

صفحات  -

تاریخ انتشار 1997